The Intensional Content of Rice's Theorem (Pearl)ASPERTI, Andrea.ACM SIGPLAN notices. 2008, Vol 43, Num 1, pp 113-119, issn 1523-2867, 7 p.Conference Paper

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour ClassesRIZZI, Romeo; CARIOLARO, David.Algorithmica. 2014, Vol 69, Num 3, pp 494-500, issn 0178-4617, 7 p.Article

Linear Complexity of a New Generalized Cyclotomic Sequence of Order Two of Length pqXIAOPING LI; WENPING MA; TONGJIANG YAN et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 5, pp 1001-1005, issn 0916-8508, 5 p.Article

Optimal controllability of 3-composed siphons in a class of Petri netsHOU, Y. F; LI, Z. W; HONG, L et al.Electronics letters. 2013, Vol 49, Num 11, pp 697-699, issn 0013-5194, 3 p.Article

Reducing model checking commitments for agent communication to model checking ARCTL and GCTLMOHAMED EL MENSHAWY; BENTAHAR, Jamal; WARDA EL KHOLY et al.Autonomous agents and multi-agent systems. 2013, Vol 27, Num 3, pp 375-418, issn 1387-2532, 44 p.Article

Approximation Algorithms for Restless Bandit ProblemsGUHA, Sudipto; MUNAGALA, Kamesh; PENG SHI et al.Journal of the Association for Computing Machinery. 2011, Vol 58, Num 1, issn 0004-5411, 3.1-3.50Article

Online railway delay management: Hardness, simulation and computationBERGER, Andre; HOFFMANN, Ralf; LORENZ, Ulf et al.Simulation (San Diego, Calif.). 2011, Vol 87, Num 7, pp 616-629, issn 0037-5497, 14 p.Article

On the complexity of computing the handicap of a sufficient matrixDE KLERK, Etienne; NAGY, Marianna E.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 383-402, issn 0025-5610, 20 p.Conference Paper

The coherence of Lukasiewicz assessments is NP-completeBOVA, Simone; FLAMINIO, Tommaso.International journal of approximate reasoning. 2010, Vol 51, Num 3, pp 294-304, issn 0888-613X, 11 p.Article

QIP = PSPACEJAIN, Rahul; ZHENGFENG JI; UPADHYAY, Sarvagya et al.Communications of the ACM. 2010, Vol 53, Num 12, pp 102-109, issn 0001-0782, 8 p.Article

A First-Order Hybrid Petri Net Model for Supply Chain ManagementDOTOLI, Mariagrazia; PIA FANTI, Maria; IACOBELLIS, Giorgio et al.IEEE transactions on automation science and engineering. 2009, Vol 6, Num 4, pp 744-758, issn 1545-5955, 15 p.Article

On neighbor discovery in cognitive radio networksMITTAL, Neeraj; KRISHNAMURTHY, Srinivasan; CHANDRASEKARAN, R et al.Journal of parallel and distributed computing (Print). 2009, Vol 69, Num 7, pp 623-637, issn 0743-7315, 15 p.Article

Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimizationSALAHI, M; TERLAKY, T.Journal of optimization theory and applications. 2007, Vol 132, Num 1, pp 143-160, issn 0022-3239, 18 p.Article

Design of multiunit electronic exchanges through decompositionDAYAMA, Pankaj; NARAHARI, Y.IEEE transactions on automation science and engineering. 2007, Vol 4, Num 1, pp 67-74, issn 1545-5955, 8 p.Article

Constraint satisfaction with bounded treewidth revisitedSAMER, Marko; SZEIDER, Stefan.Lecture notes in computer science. 2006, pp 499-513, issn 0302-9743, isbn 3-540-46267-8, 1Vol, 15 p.Conference Paper

Control of nondeterministic discrete event systems for simulation equivalenceCHANGYAN ZHOU; KUMAR, Ratnesh.IEEE Conference on Decision and Control. 2004, isbn 0-7803-8682-5, Vol 1, 507-512Conference Paper

POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMSSOSÍK, Petr; RODRÍGUEZ-PATÓN, Alfonso; CIENCIALOVAÁ, Lucie et al.Neural Network World (Prague). 2013, Vol 23, Num 1, pp 31-48, issn 1210-0552, 18 p.Conference Paper

An incremental tabu search heuristic for the generalized vehicle routing problem with time windowsMOCCIA, L; CORDEAU, J.-F; LAPORTE, G et al.The Journal of the Operational Research Society. 2012, Vol 63, Num 2, pp 232-244, issn 0160-5682, 13 p.Article

A Simple 2^o(√x) Algorithm for PARTITION and SUBSET SUMO'NEIL, Thomas E; KERLIN, Scott.Foundations of computer science. International conferenceWorldComp'2010. 2010, pp 55-58, isbn 1-60132-142-2, 4 p.Conference Paper

A new heuristic for the multi-mode resource investment problemHSU, C-C; KIM, D. S.The Journal of the Operational Research Society. 2005, Vol 56, Num 4, pp 406-413, issn 0160-5682, 8 p.Article

Determining the Positive Definiteness Margin of Interval MatricesKOLEV, Lubomir V.Reliable computing. 2007, Vol 13, Num 6, pp 445-466, issn 1385-3139, 22 p.Article

A note on relatives to the Held and Karp 1-tree problemWESTERLUND, Andreas; GÖTHE-LUNDGREN, Maud; LARSSON, Torbjörn et al.Operations research letters. 2006, Vol 34, Num 3, pp 275-282, issn 0167-6377, 8 p.Article

Presburger modal logic is PSPACE-completeDEMRI, Stéphane; LUGIEZ, Denis.Lecture notes in computer science. 2006, pp 541-556, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 16 p.Conference Paper

A moving block heuristic for minimizing earliness and tardiness on a single machine with unrestrictive common due datesMASON, Scott J; SONG JIN; JAMPANI, Jagadish et al.Journal of manufacturing systems. 2005, Vol 24, Num 4, pp 328-338, issn 0278-6125, 11 p.Article

Single machine scheduling to minimize total weighted tardinessCHENG, T. C. E; NG, C. T; YUAN, J. J et al.European journal of operational research. 2005, Vol 165, Num 2, pp 423-443, issn 0377-2217, 21 p.Conference Paper